An exact algorithm for MAX-CUT in sparse graphs
نویسندگان
چکیده
منابع مشابه
An exact algorithm for MAX-CUT in sparse graphs
We study exact algorithms for the max-cut problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O∗(2(1−(2/∆))n). We also describe a max-cut algorithm for general graphs. Its time complexity is O∗(2mn/(m+n)). Both algorithms use polynomial space. Acknowledgements: The work was done whil...
متن کاملAn exact algorithm for MAX-CUT in sparse graphs (Preliminary version)1
The MAX-CUT problem consists in partitioning the vertex set of a weighted graph into two subsets. The objective is to maximize the sum of weights of those edges that have their endpoints in two different parts of the partition. MAX-CUT is a well known NP-hard problem and it remains NP-hard even if restricted to the class of graphs with bounded maximum degree ∆ (for ∆ ≥ 3). In this paper we stud...
متن کاملThe MAX-CUT of sparse random graphs
A k-cut of a graph G = (V,E) is a partition of its vertex set into k parts; the size of the k-cut is the number of edges with endpoints in distinct parts. MAX-k-CUT is the optimization problem of finding a k-cut of maximal size and the case where k = 2 (often called MAX-CUT) has attracted a lot of attention from the research community. MAX-CUT —more generally, MAX-k-CUT— is NP-hard and it appea...
متن کاملAn Efficient Approximation Algorithm for Max-Cut
Significant research effort has been devoted in the study of approximation algorithms for NP-hard problems. Ap-proximation algorithm for Max-Cut problem with performance guarantee of 0. 87856 is long known. In this work we study balanced Max-Cut problem. We give a balancing factor ? for given ? such that the approximate solution is at least 0. 87856 times the optimal ?-balanced cut and it is it...
متن کاملA Simple MAX-CUT Algorithm for Planar Graphs
The max-cut problem asks for partitioning the nodes V of a graph G = (V,E) into two sets (one of which might be empty), such that the sum of weights of edges joining nodes in different partitions is maximum. Whereas for general instances the max-cut problem is NPhard, it is polynomially solvable for certain classes of graphs. For planar graphs, there exist several polynomial-time methods determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2007
ISSN: 0167-6377
DOI: 10.1016/j.orl.2006.04.001